Positive definite matrices and Catalan numbers, revisited

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Catalan Numbers Revisited

/ _ _ \ We define the nth Catalan number to be C n = ~ z ~ l / ( n + 1). It is ~ / known that the number of well-formed orderings of n open and n closed parentheses is C~ [3, pp. 60, 63, 64]. Many proofs of this fact involve recurrence relations and generating functions. Other proofs use combinatorial reasoning to show that the number of well-formed orderings is (2 : ) _ (~a~ 1), and then verif...

متن کامل

ON f-CONNECTIONS OF POSITIVE DEFINITE MATRICES

In this paper, by using Mond-Pečarić method we provide some inequalities for connections of positive definite matrices. Next, we discuss specifications of the obtained results for some special cases. In doing so, we use α-arithmetic, α-geometric and α-harmonic operator means.

متن کامل

Riemannian Sparse Coding for Positive Definite Matrices

Inspired by the great success of sparse coding for vector valued data, our goal is to represent symmetric positive definite (SPD) data matrices as sparse linear combinations of atoms from a dictionary, where each atom itself is an SPD matrix. Since SPD matrices follow a non-Euclidean (in fact a Riemannian) geometry, existing sparse coding techniques for Euclidean data cannot be directly extende...

متن کامل

Determinantal inequalities for positive definite matrices

Let Ai , i = 1, . . . ,m , be positive definite matrices with diagonal blocks A ( j) i , 16 j 6 k , where A ( j) 1 , . . . ,A ( j) m are of the same size for each j . We prove the inequality det( m ∑ i=1 A−1 i ) > det( m ∑ i=1 (A (1) i ) −1) · · ·det( m ∑ i=1 (A (k) i ) −1) and more determinantal inequalities related to positive definite matrices.

متن کامل

Product of three positive semi-definite matrices

In [2], the author showed that a square matrix with nonnegative determinant can always be written as the product of five or fewer positive semi-definite matrices. This is an extension to the result in [1] asserting that every matrix with positive determinant is the product of five or fewer positive definite matrices. Analogous to the analysis in [1], the author of [2] studied those matrices whi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1984

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1984-0728375-5